Regular embeddings of Kn, n where n is a power of 2. I: Metacyclic case
نویسندگان
چکیده
A 2-cell embedding of a graph in an orientable closed surface is called regular if its automorphism group acts regularly on arcs of the embedded graph. The aim of this and of the associated consecutive paper is to give a classification of regular embeddings of complete bipartite graphs Kn,n, where n = 2. The method involves groups G which factorise as a product XY of two cyclic groups of order n so that the two cyclic factors are transposed by an involutory automorphism. In particular, we give a classification of such groups G. Employing the classification we investigate automorphisms of these groups, resulting in a classification of regular embeddings of Kn,n based on that for G. We prove that given n = 2, e ≥ 3 there are, up to map isomorphism, exactly 2e−2+4 regular embeddings of Kn,n. Our analysis splits naturally into two cases depending on whether the group G is metacyclic or not.
منابع مشابه
Regular embeddings of K n , n where n is a power of 2 . II : Non - metacyclic case
In this paper, a classification of the regular embeddings of Kn,n, where n = 2e is a power of two, is completed. The number of such regular maps is one or two for e = 1, 2, respectively. For e ≥ 3 there are 2e−2 + 4 regular embeddings of K2e,2e . The method is based on classification of groups G which factorise as a product of two cyclic groups G = XY of order n such that the cyclic factors are...
متن کاملRegular Embeddings of Canonical Double Coverings of Graphs
This paper addresses the question of determining, for a given graph G, all regular maps having G as their underlying graph, i.e., all embeddings of G in closed surfaces exhibiting the highest possible symmetry. We show that if G satisfies certain natural conditions, then all orientable regular embeddings of its canonical double covering, isomorphic to the tensor product G K2 , can be described ...
متن کاملClassification of nonorientable regular embeddings of complete bipartite graphs
A 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags mutually incident vertex-edge-face triples. In this paper, we classify the regular embeddings of complete bipartite graphs Kn,n into nonorientable surfaces. Such a regular embedding of Kn,n exists only when n = 2p a1 1 p a2 2 · · · p ak k (a...
متن کاملRegular hamiltonian embeddings of Kn, n and regular triangular embeddings of Kn, n, n
We give a group-theoretic proof of the following fact, proved initially by methods of topological design theory: Up to isomorphism, the number of regular hamiltonian embeddings of Kn,n is 2 or 1, depending on whether n is a multiple of 8 or not. We also show that for each n there is, up to isomorphism, a unique regular triangular embedding of Kn,n,n. This is a preprint of an article accepted fo...
متن کاملRegular embeddings of complete bipartite graphs: classification and enumeration
The regular embeddings of complete bipartite graphs Kn,n in orientable surfaces are classified 5 and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration with Du, Kwak, Nedela and Škoviera, together with results of Itô, Hall, Huppert and Wielandt on fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007